Formal Veriication of Microprocessors: a Rst Experiment with the Coq Proof Assistant

We propose in this paper a study of the Coq proof assistant for formally verifying microprocessors. We show that interactive proofs with Coq are only required to verify complex instructions of microprocessors. We give our speciication and veriication methodology and some details about the word library developed in Coq. Two full examples show additional speciication and veriication aspects. We also give our opinion about the use of Coq in hardware veriication and some perspectives pointed by original aspects of Coq.